A discrete logarithm blob for noninteractive XOR gates
نویسندگان
چکیده
منابع مشابه
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
Most implementations of Yao’s garbled circuit approach for 2-party secure computation use the free-XOR optimization of Kolesnikov & Schneider (ICALP 2008). We introduce an alternative technique called flexible-XOR (fleXOR) that generalizes free-XOR and offers several advantages. First, fleXOR can be instantiated under a weaker hardness assumption on the underlying cipher/hash function (related-...
متن کاملA novel design for all-optical NAND/NOR/XOR gates based on nonlinear directional coupler
In this paper a novel all-optical logic NAND, NOR and XOR gate based on nonlinear directional coupler theory is demonstrated. We use the identical structure which contains three waveguides, for designing these gates; the only difference however, is the power of inputs light beam. In other words, while a beam with 4 W/μm in power considered as logical one, the output is NAND gate and if a beam w...
متن کاملA novel design for all-optical NAND/NOR/XOR gates based on nonlinear directional coupler
In this paper a novel all-optical logic NAND, NOR and XOR gate based on nonlinear directional coupler theory is demonstrated. We use the identical structure which contains three waveguides, for designing these gates; the only difference however, is the power of inputs light beam. In other words, while a beam with 4 W/μm in power considered as logical one, the output is NAND gate and if a beam w...
متن کاملRealization of Xor and Xnor Gates Using Qca Basic Gates
Quantum dot cellular automata is an emerging nanoelectronic computational architecture which has the potential of faster speed, smaller size and minimum power consumption compared to transistor-based technology. In QCA, binary information are encoded as electronic charge configuration of a cell. Fundamental unit in building of QCA circuit is a QCA cell. A QCA cell is an elementary building bloc...
متن کاملFusion Discrete Logarithm Problems
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of candidate algebraic structures which permit implementing the algorithms. In order to extend the applicability of discrete-logarithm-based cryptosystems to a much ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1990
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v19i327.6717